|
In mathematics, the Lucas sequences ''U''''n''(''P'',''Q'') and ''V''''n''(''P'',''Q'') are certain integer sequences that satisfy the recurrence relation :''x''''n'' = ''P x''''n''−1 − ''Q x''''n''−2 where ''P'' and ''Q'' are fixed integers. Any other sequence satisfying this recurrence relation can be represented as a linear combination of the Lucas sequences ''U''''n''(''P'',''Q'') and ''V''''n''(''P'',''Q''). More generally, Lucas sequences ''U''''n''(''P'',''Q'') and ''V''''n''(''P'',''Q'') represent sequences of polynomials in ''P'' and ''Q'' with integer coefficients. Famous examples of Lucas sequences include the Fibonacci numbers, Mersenne numbers, Pell numbers, Lucas numbers, Jacobsthal numbers, and a superset of Fermat numbers. Lucas sequences are named after the French mathematician Édouard Lucas. == Recurrence relations == Given two integer parameters ''P'' and ''Q'', the Lucas sequences of the first kind ''U''''n''(''P'',''Q'') and of the second kind ''V''''n''(''P'',''Q'') are defined by the recurrence relations: : : : and : : : It is not hard to show that for , : : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Lucas sequence」の詳細全文を読む スポンサード リンク
|